The random Fibonacci recurrence and the visible points of the plane
نویسنده
چکیده
Abstract In this letter, we show a connection between the random Fibonacci recurrence and the visible points of the plane. In particular, we show that by suitably modifying the rules of the random Fibonacci map, there is a unique correspondence between the visible points (points with relative prime coordinates) of the first quadrant and the vertices of a self-similar graph (what we call the Fibonacci graph). The proposed random recurrence can then be interpreted as a random walk on this graph.
منابع مشابه
Toeplitz transforms of Fibonacci sequences
We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.
متن کاملNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملOn some properties and applications of Horadam sequences
The Horadam sequence is a generalization of the Fibonacci numbers in the complex plane, depending on a family of four complex parameters: two recurrence coefficients and two initial conditions. The necessary and sufficient periodicity conditions formulated in [1] are used to enumerate all Horadam sequences with a given period [2]. The geometry of periodic orbits is analyzed, where regular star-...
متن کاملRandom Vortex Method for Geometries with Unsolvable Schwarz-Christoffel Formula
In this research we have implemented the Random Vortex Method to calculate velocity fields of fluids inside open cavities in both turbulent and laminar flows. the Random Vortex Method is a CFD method (in both turbulent and laminar fields) which needs the Schwarz-Christoffel transformation formula to map the physical geometry into the upper half plane. In some complex geometries like the flow in...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کامل